Terminating modal tableaux with simple completeness proof
نویسندگان
چکیده
In this paper we study formal tools for the definition of tableaux systems for modal logics. We begin by some preliminaries about graphs. Then we present graph rewriting rules together with control constructs for defining strategies of application of these rules. We establish fair strategies that are sound, complete and terminating. These results cover almost all basic modal logics such as K, T, S4, KB4, K+Confluence etc., and can be generalized for logics such LTL and PDL. Our framework provides the theoretical basis for our generic tableau theorem prover LoTREC.
منابع مشابه
Terminating Tableaux for Modal Logic with Transitive Closure
We present a terminating tableau system for the modal logic K∗. K∗ extends the basic modal logic K with a reflexive transitive closure operator for relations and is a proper fragment of propositional dynamic logic. We investigate two different approaches to achieve termination, namely chain-based blocking and pattern-based blocking. Pattern based-blocking has not been applied to a modal logic w...
متن کاملTerminating Tableaux for Hybrid Logic with the Difference Modality and Converse
We present the first terminating tableau calculus for basic hybrid logic with the difference modality and converse modalities. The language under consideration is basic multi-modal logic extended with nominals, the satisfaction operator, converse, global and difference modalities. All of the constructs are handled natively. To obtain termination, we extend chain-based blocking for logics with c...
متن کاملHTab: a Terminating Tableaux System for Hybrid Logic
Hybrid logic is a formalism that is closely related to both modal logic and description logic. A variety of proof mechanisms for hybrid logic exist, but the only widely available implemented proof system, HyLoRes, is based on the resolution method. An alternative to resolution is the tableaux method, already widely used for both modal and description logics. Tableaux algorithms have also been d...
متن کاملA Simple Tableau System for the Logic of Elsewhere
We analyze different features related to the mechanization of von Wright’s logic of elsewhere E . First, we give a new proof of the NP-completeness of the satisfiability problem (giving a new bound for the size of models of the satisfiable formulae) and we show that this problem becomes linear-time when the number of propositional variables is bounded. Although E and the well-known propositiona...
متن کاملFree Variable Tableaux for Propositional Modal Logics
Free-variable semantic tableaux are a well-established technique for first-order theorem proving where free variables act as a meta-linguistic device for tracking the eigenvariables used during proof search. We present the theoretical foundations to extend this technique to propositional modal logics, including non-trivial rigorous proofs of soundness and completeness, and also present various ...
متن کامل